On Primes in Arithmetic Progression Having a Prescribed Primitive Root
نویسندگان
چکیده
منابع مشابه
On the density of primes in arithmetic progression having a prescribed primitive root
Let g ∈ Q be not −1 or a square. Let Pg denote the set of primes p such that g is a primitive root mod p. Let 1 ≤ a ≤ f, (a, f) = 1. Under the Generalized Riemann Hypothesis (GRH) it can be shown that the set of primes p ∈ Pg with p ≡ a(mod f) has a natural density. In this note this density is explicitly evaluated. This generalizes a classical result of Hooley.
متن کاملOn primes in arithmetic progression having a prescribed primitive root. II
Let a and f be coprime positive integers. Let g be an integer. Under the Generalized Riemann Hypothesis (GRH) it follows by a result of H.W. Lenstra that the set of primes p such that p ≡ a(mod f) and g is a primitive root modulo p has a natural density. In this note this density is explicitly evaluated with an Euler product as result.
متن کاملPrimes in arithmetic progression
Prime numbers have fascinated people since ancient times. Since the last century, their study has acquired importance also on account of the crucial role played by them in cryptography and other related areas. One of the problems about primes which has intrigued mathematicians is whether it is possible to have long strings of primes with the successive primes differing by a fixed number, namely...
متن کاملNotes on Primes in Arithmetic Progression
The following is a quick set of notes of some properties of Dirichlet characters, in particular, how they are used to prove the infinitude of primes in arithmetic progressions. These notes are from from An Invitation to Modern Number Theory, by myself and Ramin Takloo-Bighash. As this is a modified snippet from the book, references to other parts of the book are displayed as ??. 1. Dirichlet Ch...
متن کاملPrimes in Arbitrarily Long Arithmetic Progression
It has been a long conjecture that there are arbitrarily long arithmetic progressions of primes. As of now, the longest known progression of primes is of length 26 and was discovered by Benoat Perichon and PrimeGrid in April, 2010 ([1]): 43142746595714191+23681770·223092870n for n = 0, 1, · · · , 25. Many mathematicians have spent years trying to prove (or disprove) this conjecture, and even mo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Number Theory
سال: 1999
ISSN: 0022-314X
DOI: 10.1006/jnth.1999.2409